Solving the mixed Sylvester matrix equations by matrix decompositions

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solving Linear Matrix Equations by Matrix Decompositions

In this paper, a system of linear matrix equations is considered. A new necessary and sufficient condition for the consistency of the equations is derived by means of the generalized singular-value decomposition, and the explicit representation of the general solution is provided. Keywords—Matrix equation, Generalized inverse, Generalized singular-value decomposition.

متن کامل

On the solving matrix equations by using the spectral representation

‎The purpose of this paper is to solve two types of Lyapunov equations and quadratic matrix equations by using the spectral representation‎. ‎We focus on solving Lyapunov equations $AX+XA^*=C$ and $AX+XA^{T}=-bb^{T}$ for $A‎, ‎X in mathbb{C}^{n times n}$ and $b in mathbb{C} ^{n times s}$ with $s < n$‎, ‎which $X$ is unknown matrix‎. ‎Also‎, ‎we suggest the new method for solving quadratic matri...

متن کامل

On the numerical solution of generalized Sylvester matrix equations

‎The global FOM and GMRES algorithms are among the effective‎ ‎methods to solve Sylvester matrix equations‎. ‎In this paper‎, ‎we‎ ‎study these algorithms in the case that the coefficient matrices‎ ‎are real symmetric (real symmetric positive definite) and extract‎ ‎two CG-type algorithms for solving generalized Sylvester matrix‎ ‎equations‎. ‎The proposed methods are iterative projection metho...

متن کامل

On the solving of matrix equation of Sylvester type

A solution of two problems related to the matrix equation of Sylvester type is given. In the first problem, the procedures for linear matrix inequalities are used to construct the solution of this equation. In the second problem, when a matrix is given which is not a solution of this equation, it is required to find such solution of the original equation, which most accurately approximates the ...

متن کامل

An accelerated gradient based iterative algorithm for solving systems of coupled generalized Sylvester-transpose matrix equations

‎In this paper‎, ‎an accelerated gradient based iterative algorithm for solving systems of coupled generalized Sylvester-transpose matrix equations is proposed‎. ‎The convergence analysis of the algorithm is investigated‎. ‎We show that the proposed algorithm converges to the exact solution for any initial value under certain assumptions‎. ‎Finally‎, ‎some numerical examples are given to demons...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Comptes Rendus Mathematique

سال: 2015

ISSN: 1631-073X

DOI: 10.1016/j.crma.2015.08.010